Subcomplete generalizations of graph isomorphism
نویسندگان
چکیده
منابع مشابه
Graph Isomorphism
While in general it is not known whether there is a polynomial time algorithm to decide whether two given graphs are isomorphic, there are polynomial-time algorithms for certain subsets of graphs, including but not limited to planar graphs and graphs with bounded valence. In this thesis, we will give a brief introduction on the Graph Isomorphism Problem and its relations to complexity theory. W...
متن کاملGraph Invariants and Graph Isomorphism
In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...
متن کاملRelaxations of Graph Isomorphism
We introduce a nonlocal game that captures and extends the notion of graph isomorphism. This game can be won in the classical case if and only if the two input graphs are isomorphic. Thus, by considering quantum strategies we are able to define the notion of quantum isomorphism. We also consider the case of more general non-signalling strategies, and show that such a strategy exists if and only...
متن کاملGraph isomorphism is polynomial
We show that the graph isomorphism problem is determined in a polynomial time. This is done by showing that that two graphs on n vertices are isomorphic if and only if a corresponding system of (4n− 1)n equations in n nonnegative variables is solvable. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملRandom Graph Isomorphism
Abstract. A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i .e. all but o(2 (2 >) of the 2 t 1 graphs on n vertices) . Hence, for almost all graphs X, any graph Y can be easily tested for isomorphism to X by an extremely naive linear time algorithm . This result is based on the following : In almost all graphs on n vertices, the largest n 0 .15...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1982
ISSN: 0022-0000
DOI: 10.1016/0022-0000(82)90015-0